Confluence of Conditional Term Rewrite Systems via Transformations
نویسندگان
چکیده
منابع مشابه
Confluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملConfluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, ...
متن کاملTransformations of Conditional Term Rewrite Systems
Term rewriting is a well understood and commonly used framework in theoretical computer science for program analysis and program verification. An intuitive extension of term rewrite systems are conditional term rewrite systems. Yet, although they are more natural for certain tasks, they turn out to be more complex to analyze. In order to better understand and implement conditional term rewrite ...
متن کاملConfluence of Terminating Conditional Rewrite Systems Revisited
We present a new and powerful criterion for connuence of terminating (terms in) join conditional term rewriting systems. This criterion is based on a certain joinability property for shared parallel critical peaks and does neither require the systems to be decreasing nor left-linear nor normal, but only terminating.
متن کاملNotes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
Transforming conditional term rewrite systems (CTRSs) into unconditional systems (TRSs) is a common approach to analyze properties of CTRSs via the simpler framework of unconditional rewriting. In the past many different transformations have been introduced for this purpose. One class of transformations, so-called unravelings, have been analyzed extensively in the past. In this paper we provide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.235.3